A Bond Graph Algorithm to Determine the Equilibrium State of a System
نویسنده
چکیده
An algorithm is presented which enables one to determine the nature of the equilibrium state of a system with constant inputs by direct inspection of its bond graph representation. The algorithm determines whether or not there exists a unique equilibrium state (within a certain region). If not, the system may have no (or injinitely many) equilibrium states in the linear case.
منابع مشابه
Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملAdaptive Neuro Fuzzy Sliding Mode Based Genetic Algorithm Control System to Control of a pH Neutralization Process
In this paper, an adaptive neuro fuzzy sliding mode based genetic algorithm (ANFSGA) controlsystem is proposed for a pH neutralization system. In pH reactors, determination and control of pH isa common problem concerning chemical-based industrial processes due to the non-linearity observedin the titration curve. An ANFSGA control system is designed to overcome the complexity of precisecontrol o...
متن کاملAn Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملA graph search algorithm: Optimal placement of passive harmonic filters in a power system
The harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. This paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. The objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...
متن کامل